Abstract simplicial complex

Results: 90



#Item
3116th Canadian Conference on Computational Geometry, 2004  Simplicial Depth: An Improved Definition, Analysis, and Efficiency for the Finite Sample Case Michael A. Burr

16th Canadian Conference on Computational Geometry, 2004 Simplicial Depth: An Improved Definition, Analysis, and Efficiency for the Finite Sample Case Michael A. Burr

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
32Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Add to Reading List

Source URL: www.jeffreybyrne.com

Language: English - Date: 2013-05-01 13:34:08
33ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-10-30 10:03:20
34Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-06-02 03:40:55
35Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-11-04 06:42:35
36VERTEX COLORINGS OF SIMPLICIAL COMPLEXES NATALIA DOBRINSKAYA, JESPER M. MØLLER, AND DIETRICH NOTBOHM Contents 1. Introduction 1.1. Notation and the basic definition

VERTEX COLORINGS OF SIMPLICIAL COMPLEXES NATALIA DOBRINSKAYA, JESPER M. MØLLER, AND DIETRICH NOTBOHM Contents 1. Introduction 1.1. Notation and the basic definition

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2010-07-05 04:18:21
37Vietoris-Rips complexes of circular points Michal Adamaszek Max Planck Institute for Informatics, Saarbr¨ ucken  Joint work-in-progress with

Vietoris-Rips complexes of circular points Michal Adamaszek Max Planck Institute for Informatics, Saarbr¨ ucken Joint work-in-progress with

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2015-03-23 03:34:01
38Math. Appl), 167–175 DOI: maNEW BOUNDS FOR IRRATIONALITY MEASURES OF SOME FAST CONVERGING SERIES ˇ

Math. Appl), 167–175 DOI: maNEW BOUNDS FOR IRRATIONALITY MEASURES OF SOME FAST CONVERGING SERIES ˇ

Add to Reading List

Source URL: ma.fme.vutbr.cz

Language: English - Date: 2015-01-08 02:59:20
39A Graph-Based, Metric Space Proximity Calculator for Internet Objects Kevin Huggins  David Carteret

A Graph-Based, Metric Space Proximity Calculator for Internet Objects Kevin Huggins David Carteret

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2004-07-02 05:16:26
40NNS lower bounds via metric expansion for l∞ and EM D Michael Kapralov1? and Rina Panigrahy2 1  2

NNS lower bounds via metric expansion for l∞ and EM D Michael Kapralov1? and Rina Panigrahy2 1 2

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50